- $k$-universal hash function family
- <08> $k$-универсальное семейство хэш-функций
Сборный англо-русский словарь. Академик.ру. 2011.
$k$-universal hash function family
Смотреть что такое "$k$-universal hash function family" в других словарях:
Cryptographic hash function — A cryptographic hash function (specifically, SHA 1) at work. Note that even small changes in the source input (here in the word over ) drastically change the resulting output, by the so called avalanche effect. A cryptographic hash function is a… … Wikipedia
Universal hashing — is a randomized algorithm for selecting a hash function F with the following property: for any two distinct inputs x and y , the probability that F(x)=F(y) (i.e., that there is a hash collision between x and y ) is the same as if F was a random… … Wikipedia
UOWHF — In cryptography a Universal One Way Hash Function (UOWHF), often pronounced woof , is a cryptographic hash function. UOWHF s are proposed as an alternative to CRHF s. Collision Resistant Hash Functions (CRHF) are based on the stronger assumption… … Wikipedia
Хандшух, Хелен — Хелен Хандшух (англ. Helena Handschuh) криптограф. Наиболее известная разработка симметричный блочный криптоалгоритм SHACAL. Помимо этого принимала участие в создании блочного шифра Universal Encryption Standard. С 2009 года… … Википедия
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия
MinHash — In computer science, MinHash (or the min wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating how similar two sets are. The scheme was invented by Andrei Broder (1997),[1] and initially used… … Wikipedia
Digital signature — This article is about secure cryptographic signatures. For simple signatures in digital form, see Electronic signature. A digital signature or digital signature scheme is a mathematical scheme for demonstrating the authenticity of a digital… … Wikipedia
Tiger (cryptography) — Tiger General Designers Ross Anderson and Eli Biham First published 1996 Detail Digest sizes 192, 128, 160 Rounds 24 In cryptography, Tiger is a … Wikipedia
List of combinatorics topics — This is a list of combinatorics topics.A few decades ago it might have been said that combinatorics is little more than a way to classify poorly understood problems, and some standard remedies. Great progress has been made since 1960.This page is … Wikipedia
